A new heuristic for bad cycle detection using BDDsHARDIN, R. H; SHUKLA, S. K; KURSHAN, R. P et al.Lecture notes in computer science. 1997, pp 268-278, issn 0302-9743, isbn 3-540-63166-6Conference Paper

VeriSoft : A tool for the automatic analysis of concurrent reactive softwareGODEFROID, P.Lecture notes in computer science. 1997, pp 476-479, issn 0302-9743, isbn 3-540-63166-6Conference Paper

On proving time constructibility of functionsKUBAYASHI, K.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 215-225, issn 0304-3975Article

Some remarks on subclass containment problems for several classes of DPPA'SOYAMAGUCHI, M.Information processing letters. 1984, Vol 19, Num 1, pp 9-12, issn 0020-0190Article

SOME REMARKS ON THE EXTENSION OF A FINITE SET OF STOCHASTIC AUTOMATA.JANICKI S; SZYNAL D.1975; ZASTOSOW. MAT.; POLSKA; DA. 1975; VOL. 14; NO 4; PP. 549-564; ABS. POL.; BIBL. 14 REF.Article

ON 3-HEARD VERSUS 2-HEAD FINITE AUTOMATA.IBARRA OH; KIM CE.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 2; PP. 193-100; BIBL. 5 REF.Article

PREDECESSOR MACHINES. = MACHINES DE PRECEDENCEFISCHER PC.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 2; PP. 190-219; BIBL. 10 REF.Article

OPTIMALSTEUERUNG MIT DIGITAL-ARBEITENDEN SYSTEMEN. = COMMANDE OPTIMALE AVEC DES SYSTEMES FONCTIONNANT NUMERIQUEMENTFELLBERG G.1974; Z. ELEKTR. INFORM.-U. ENERGIETECH.; DTSCH.; DA. 1974; VOL. 4; NO 6; PP. 350-352; BIBL. 3 REF.Article

UBER DIE EXPERIMENTMENGEN DETERMINIERTER AUTOMATEN = SUR LES AUTOMATES DETERMINISTESSTARKE PH.1972; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1972; VOL. 8; NO 2-3; PP. 67-76; ABS. ANGL., RUSSE; BIBL. 3 REF.Serial Issue

Deciding DPDA equivalence is primitive recursiveSTIRLING, Colin.Lecture notes in computer science. 2002, pp 821-832, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Cost functors and optimal realizationBAHAMONDE, A.Journal of computer and system sciences (Print). 1985, Vol 30, Num 3, pp 274-290, issn 0022-0000Article

Three-way automata on rectangular tapes over a one-letter alphabetKINBER, E. B.Information sciences. 1985, Vol 35, Num 1, pp 61-77, issn 0020-0255Article

On the complement of stabilized perturbation of incomplete automata with almost reliable communication channel depending on the timeBUI MINH TRI.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 496. 1984, 27 p.Report

A fast algorithm for constructing a tree automaton recognizing a congruential tree languageVAGVÖLGYI, S.Theoretical computer science. 1993, Vol 115, Num 2, pp 391-399, issn 0304-3975Article

Projection lemnas for ω-languagesSTAIGER, L.Theoretical computer science. 1984, Vol 32, Num 3, pp 331-337, issn 0304-3975Article

Some negative results concerning DPDÁsCOURCELLE, B.Information processing letters. 1984, Vol 18, Num 5, pp 285-289, issn 0020-0190Article

The aymptotic optimality of discretized linear reward-inaction learning automataOOMMEN, B. J; HANSEN, E.IEEE transactions on systems, man, and cybernetics. 1984, Vol 14, Num 3, pp 542-545, issn 0018-9472Article

On nonforgetting restarting automata that are deterministic and/or monotoneMESSERSCHMIDT, Hartmut; OTTO, Friedrich.Lecture notes in computer science. 2006, pp 247-258, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 12 p.Conference Paper

Containment of regular languages in non-regular timing diagram languages is decidableFISLER, K.Lecture notes in computer science. 1997, pp 155-166, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Unions of certain bounded deterministic languagesJONES, L. P; GOLDSTINE, J.International journal of computer mathematics. 1984, Vol 16, Num 2, pp 99-113, issn 0020-7160Article

CIRCUITS SEQUENTIELS ANTITONIQUES AUTONOMES. MINIMISATIONSTARODUBTSEV NA.1981; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1981; NO 6; PP. 82-86; BIBL. 4 REF.Article

UEBER EINIGE GRUNDLAGEN FUER EINE ALLGEMEINE THEORIE DETERMINISTISCHER SYSTEME. = QUELQUES BASES POUR UNE THEORIE GENERALE DES SYSTEMES DETERMINISTESLOCKE M; IHLE E.1978; Z. ELEKTR. INFORM.-U. ENERGIETECH.; DTSCH.; DA. 1978; VOL. 8; NO 1; PP. 51-60; BIBL. 8 REF.Article

VARIOUS KINDS OF AUTOMATA WITH WEIGHTS.MIZUMOTO M; TOYODA J; TANAKA K et al.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 219-236; BIBL. 21 REF.Article

THE EQUIVALENCE PROBLEM FOR DETERMINISTIC FINITE-TURN PUSHDOWN AUTOMATA.VALIANT LG.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 25; NO 2; PP. 123-133; BIBL. 6 REF.Article

NOMBRE DE TOURS DE LA TETE A PILE D'UN AUTOMATE MP A DEUX VOIES AVEC MEMOIREBARASHKO AS.1974; KIBERNETICA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 4; PP. 9-14; ABS. ANGL.; BIBL. 6 REF.Article